A Data Model for Effectively Computable Functions
نویسنده
چکیده
Searching for a better data model would continue unless a satisfaction was reached. Improving the productivity and quality of developing traditional and emerging database applications is the motivation driving the research activities. This abstract is to introduce the approach of a data model EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectively computable functions. Its queries are arbitrary computable functions. Both the data structure and the queries of the EP data model are unified under an extended lambda caculus, which provides a uniform manner to access data (either finite or infinite).
منابع مشابه
Feedback computability on Cantor space
We introduce the notion of feedback computable functions from 2 to 2, extending feedback Turing computation in analogy with the standard notion of computability for functions from 2 to 2. We then show that the feedback computable functions are precisely the effectively Borel functions. With this as motivation we define the notion of a feedback computable function on a structure, independent of ...
متن کاملTrade Liberalization and International Competitiveness in Iran: An Application of Computable General Equilibrium (CGE) Model
Trade liberalization is often the core attention of foreign economic strategies in developing countries. Findings in the literature confirm a significant effect of free trade on developing economies through which the economic sectors benefit from technology transfer and spillovers and increasing production capacities and input productivity leading to international competitiveness. On the other...
متن کاملInvestigating the Economic Effects of Amendment of Law of Value Added Tax (VAT) in Iran: Computable General Equilibrium Model (CGE) Approach
The purpose of this paper is to investigate the economic effects of amendment of law of value added tax in Iran. The research method is quantitative and standard CGE model of Lafgren et al (2002) is used for analyzing. Data are derived from the latest Social Accounting Matrix (SAM) of Iran in 2011, which is provided by the Research Center of the Parliament. The data are analyzed in the form of ...
متن کاملFine Computable Functions and Effective Fine Convergence
In this article, we discuss the Fine computability and the effective Fine convergence for functions on [0, 1) with respect to the Fine metric as the beginning of the effective Walsh-Fourier analysis. First we treat classically the Fine continuity and the Fine convergence. Next, we prove that Fine computability does not depend on the choice of an effective separating set. Subsequently, we propos...
متن کاملCharacterizing the Computable Structures: Boolean Algebras and Linear Orders
A countable structure (with finite signature) is computable if its universe can be identified with ω in such a way as to make the relations and operations computable functions. In this thesis, I study which Boolean algebras and linear orders are computable. Making use of Ketonen invariants, I study the Boolean algebras of low Ketonen depth, both classically and effectively. Classically, I give ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000